A New Abstraction Framework for Affine Transformers
نویسندگان
چکیده
This paper addresses the problem of abstracting a set of affine transformers ÝÑv 1 ÝÑv C ÝÑ d , where ÝÑv and ÝÑv 1 represent the prestate and post-state, respectively. We introduce a framework to harness any base abstract domain B in an abstract domain of affine transformations. Abstract domains are usually used to define constraints on the variables of a program. In this paper, however, abstract domain B is repurposed to constrain the elements of C and ÝÑ d —thereby defining a set of affine transformers on program states. This framework facilitates intraand interprocedural analyses to obtain function and loop summaries, as well as to prove program assertions.
منابع مشابه
A Method for Symbolic Computation of Precise Abstract Transformers
In 1979, Cousot and Cousot gave a specification of the “best” (most-precise) abstract transformer possible for a given concrete transformer and a given abstract domain. Unfortunately, their specification does not lead to an algorithm for obtaining best transformers. In fact, algorithms are known for only a few abstract domains. This paper presents a parametric framework that, for some abstract ...
متن کاملA Modular Static Analysis Approach to Affine Loop Invariants Detection (Extended Version)
Modular static analyzers use procedure abstractions, a.k.a. summarizations, to ensure that their execution time increases linearly with the size of analyzed programs. A similar abstraction mechanism is also used within a procedure to perform a bottom-up analysis. For instance, a sequence of instructions is abstracted by combining the abstractions of its components, or a loop is abstracted using...
متن کاملA Modular Static Analysis Approach to Affine Loop Invariants Detection
Modular static analyzers use procedure abstractions, a.k.a. summarizations, to ensure that their execution time increases linearly with the size of analyzed programs. A similar abstraction mechanism is also used within a procedure to perform a bottom-up analysis. For instance, a sequence of instructions is abstracted by combining the abstractions of its components, or a loop is abstracted using...
متن کاملA Topology-Based Approach for Lightweight 3-Valued Logic Shape Analysis
Although a highly desirable static analysis practice, precise shape analysis is widely considered a computational dead-end for most practical purposes. In this work, we explore ways to overrule this belief, by revisiting and improving over a well-founded shape analysis framework, that is based on 3-valued logic abstraction [6]. While the worst-case exponential asymptotic complexity bound induce...
متن کاملA new model for Assessment and Optimization of Number of Spare Transformers and their Locations in Distribution Systems
In this paper, a new model has been presented to determine the number of spare transformers and their locations for distribution stations. The number of spare transformers must be so that they need minimum investment. Furthermore, they must be sufficient for replacing with transformers that have been damaged. For this reason, in this paper a new purpose function has been presented to maximize p...
متن کامل